Closed Terminologies in Description Logics

نویسنده

  • Robert A. Weida
چکیده

We introduce a predictive concept recognition methodology for description logics based on a new closed terminology assumption. During knowledge engineering, our system adopts the standard open terminology assumption as it automatically classifies concept descriptions into a taxonomy via subsumption inferences. However, for applications like configuration, the terminology becomes fixed during problem solving. Then, closed terminology reasoning is more appropriate. In our interactive configuration application, a user incrementally specifies an individual computer system in collaboration with a configuration engine. Choices can be made in any order and at any level of abstraction. We distinguish between abstract and concrete concepts to formally define when an individual’s description may be considered finished. We also take advantage of the closed terminology assumption, together with the terminology’s subsumptionbased organization, to efficiently track the types of systems and components consistent with current choices, infer additional constraints on current choices, and appropriately guide future choices. Thus, we can help focus the efforts of both user and configuration engine. which specializes in configuration problem solving, utilizes a DL system to represent and reason with a KB, which contains both a configuration terminology and a description of of the individual configuration being worked on. The configuration engine can make significant use of traditional DL inferences, as well as new inferences introduced here.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Natural Language Documents: a DL Based Approach

We propose a method to compare semantically two natural language texts. The process is realized in two steps, the first translates the texts into description logics terminologies. The second computes the difference between the terminologies obtained. We show how the best covering problem can be used to compute the difference between two terminologies and propose a method to calculate this diffe...

متن کامل

Learning Multiple Description Logics Concepts

Description logics based languages have became the standard representation scheme for ontologies. They formalize the domain knowledge using interrelated concepts, contained in terminologies. The manual definition of terminologies is an expensive and error prone task, therefore automatic learning methods are a necessity. In this paper we lay the foundations of a multiple concept learning method ...

متن کامل

A Kernel Revision Operator for Terminologies

In this paper, we propose a new method for revising terminologies in description logic-based ontologies. Our revision method is a reformulation of the kernel revision operator in belief revision. We first define our revision operator for terminologies in terms of MIPS (minimal incoherence-preserving sub-terminologies), and we show that it satisfies some desirable logical properties. Second, two...

متن کامل

Rule Based Computation of Updates to Terminologies

In this paper we formalise compilation of the conjunctive bodies of a restricted class of Horn rules into updates on terminologies. This involves a pre-processing of the graphs representing connections between terms in a rule body. We motivate and illustrate application of this work in hybrid Description Logic/Rule based frameworks for medical plan specification.

متن کامل

The Logical Difference Problem for Description Logic Terminologies

We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we present a tractable algorithm which, given two terminologies and a signature, outputs a set of concepts, which can be regarded as the logical difference between the two terminologies. As a consequence, the algorithm can also decid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996